Floating-point versus Symbolic Computations in theQD-algorithm
نویسندگان
چکیده
منابع مشابه
Floating-point versus Symbolic Computations in theQD-algorithm
The convergence of columns in the univariate qd-algorithm to reciprocals of polar singularities of meromorphic functions has often proved to be very useful. Any q-column corresponding to a “simple pole of isolated modulus” converges to the reciprocal of the corresponding pole. By performing an equivalence transformation of the underlying corresponding continued fraction and programming the new ...
متن کاملSymbolic execution of floating-point computations
Symbolic execution is a classical program testing technique which evaluates a selected control flow path with symbolic input data. A constraint solver can be used to enforce the satisfiability of the extracted path conditions as well as to derive test data. Whenever path conditions contain floating-point computations, a common strategy consists of using a constraint solver over the rationals or...
متن کاملReproducible Parallel Floating-Point Computations
Because of rounding errors, floating-point operations such as addition and multiplication are not associative, computed results depend also on the order of computation. Therefore we cannot get the same answer from run-to-run even on the same machine with varying number of available processors. That makes understanding the reliability of output harder, especially with the increasing level of par...
متن کاملAbstract Interpretation of Floating-Point Computations
Interpretation of Floating-Point Computations Sylvie Putot Laboratory for ModElling and Analysis of Systems in Interaction, CEA-LIST/X/CNRS Session: Static Analysis for Safety and Performance ARTIST2 MOTIVES Trento Italy, February 19-23, 2007 Sylvie Putot Laboratory for ModElling and Analysis of Systems in Interaction, CEA-LIST/X/CNRS Abst Interpretation of Floating-Point Computations
متن کاملSymbolic execution of oating point computations
Symbolic execution is a classical program testing technique which evaluates a se lected control ow path with symbolic input data A constraint solver can be used to enforce the satis ability of the extracted path conditions as well as to derive test data Whenever path conditions contain oating point computations a common strategy consists of using a constraint solver over the rationals or the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1997.0162